Randomized algorithms

Results: 419



#Item
11Analysis of algorithms / Academia / Online algorithms / Computer science / Probabilistic complexity theory / Randomized algorithm / Adversary model / Algorithm / Data binning / Labeling theory / Mathematics

Charles University in Prague Faculty of Mathematics and Physics DOCTORAL THESIS Jan Bul´anek

Add to Reading List

Source URL: iuuk.mff.cuni.cz

Language: English - Date: 2014-07-29 07:02:19
12Algorithms / Randomized rounding / Rounding / Mathematics / Academia / Applied mathematics

The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
13Cryptography / Computational complexity theory / Pseudorandomness / Analysis of algorithms / Probabilistic complexity theory / Pseudorandom function family / Randomized algorithm / Random number generation / Pseudorandom number generator / One-way function / Advantage / IP

Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER,

Add to Reading List

Source URL: groups.csail.mit.edu

Language: English - Date: 2003-04-15 15:57:50
14Algebra / Mathematics / Multivariate statistics / Numerical analysis / Numerical linear algebra / Iterative methods / Dimension reduction / Principal component analysis / Singular value decomposition / Stochastic optimization / Nonlinear dimensionality reduction / Sparse dictionary learning

I will discuss recent work on randomized algorithms for low-rank approximation and principal component analysis (PCA). The talk will focus on efforts that move beyond the extremely fast, but relatively crude approximatio

Add to Reading List

Source URL: mmds-data.org

Language: English - Date: 2016-06-23 15:50:48
15Mathematics / Search algorithms / Information retrieval / Information science / Hashing / Analysis of algorithms / Cryptographic hash functions / Computational complexity theory / Universal hashing / Hash function / Randomized algorithm / Subset sum problem

Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Add to Reading List

Source URL: web.stanford.edu

Language: English - Date: 2014-04-18 04:16:48
16Analysis of algorithms / Computational complexity theory / Theory of computation / Mathematics / Balls into bins / With high probability / Sorting algorithm / Leader election / Time complexity / Entropy / Best /  worst and average case / Big O notation

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:31
17Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / FO / Mathematics / Computer science / Theoretical computer science / Analytic geometry

Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions Pankaj K. Agarwaly Micha Sharirz

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2012-06-29 10:27:51
18Computational complexity theory / Graph theory / Mathematics / Phylogenetics / NP-complete problems / Computational phylogenetics / Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Steiner tree problem / Algorithm / Maximum parsimony

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2009-01-01 08:42:54
19Operations research / Algorithm / Mathematical logic / Theoretical computer science / Mathematical optimization / Academia / Mathematics / Applied mathematics / Dynamic programming / Randomized algorithms as zero-sum games / Randomized rounding

CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-29 00:22:18
20Computational complexity theory / Mathematics / Theory of computation / Analysis of algorithms / Scheduling / Polynomial-time approximation scheme / Makespan / Time complexity / Partition / Randomized algorithm / Algorithm / Integral

Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-05-11 07:37:06
UPDATE